Rapid adaptation using penalized-likelihood methods
نویسندگان
چکیده
In this paper, we introduce new rapid adaptation techniques that extend and improve two successful methods previously introduced, cluster weighting (CW) and MAPLR. First, we introduce a new adaptation scheme called CWB which extends the cluster weighting adaptation method by including a bias term and a reference speaker model. CWB is shown to improve the adaptation performance as compared to CW. Second, we introduce an extension of cluster weighting that uses penalized-likelihood objective functions to stabilize the estimation and provide soft constraints. Third, we propose a variant of MAPLR adaptation that uses prior speaker information. Previously, prior distributions of transforms in MAPLR were obtained using the same adaptation data, speaker independent HMMmeans or by some heuristics. We propose to use the prior information of speaker variability to obtain the priors, by using CW or CWB weights. Penalized-likelihood or Bayesian theory serves as a tool to combine transformation based and prior speaker information based adaptation methods resulting in effective rapid adaptation techniques. The techniques are shown to outperform full, block diagonal and diagonal MLLR as well as some other recently proposed methods for rapid adaptation.
منابع مشابه
Spatial Resolution in Penalized-Likelihood Image Reconstruction
Spatial Resolution in Penalized-Likelihood Image Reconstruction byJoseph Webster Stayman Chair: Jeffrey A. Fessler Penalized-likelihood methods have been used widely in image reconstruction sincethey can model both the imaging system geometry and measurement noise verywell. However, images reconstructed by conventional penalized-likelihood methodsare subject to anisotropic and s...
متن کاملOne-step Sparse Estimates in Nonconcave Penalized Likelihood Models.
Fan & Li (2001) propose a family of variable selection methods via penalized likelihood using concave penalty functions. The nonconcave penalized likelihood estimators enjoy the oracle properties, but maximizing the penalized likelihood function is computationally challenging, because the objective function is nondifferentiable and nonconcave. In this article we propose a new unified algorithm ...
متن کاملEvaluating haplotype effects in case-control studies via penalized-likelihood approaches: prospective or retrospective analysis?
Penalized likelihood methods have become increasingly popular in recent years for evaluating haplotype-phenotype association in case-control studies. Although a retrospective likelihood is dictated by the sampling scheme, these penalized methods are typically built on prospective likelihoods due to their modeling simplicity and computational feasibility. It has been well documented that for unp...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملPenalized Likelihood Regression in Reproducing Kernel Hilbert Spaces with Randomized Covariate Data
Penalized likelihood regression consists of a category of commonly used regularization methods, including regression splines with RKHS penalty and the LASSO. When the observed data comes from a non-Gaussian exponential family distribution, a penalized log-likelihood is commonly used to estimate of the regression function. This technique allows a flexible form of the estimator and aims at an app...
متن کامل